Better Approximation Algorithms for Technology Diffusion
نویسندگان
چکیده
Motivated by cascade effects arising in network technology upgrade processes in the Internet, Goldberg and Liu [SODA, 2013] recently introduced the following natural technology diffusion problem. Given a graph G = (V,E), and thresholds θ(v), for all v ∈ V . A vertex u activates if it is adjacent to a connected component of active nodes of size at least θ(v). The goal is to find a seed set A whose initial activation would trigger a cascade activating the entire graph. Goldberg and Liu presented an algorithm for this problem that returns a seed set of size O(rl log(n)) times that of an optimum seed set, where r is the diameter of the given graph, and l is the number of distinct thresholds used in the instance. We improve upon this result by presenting an O(min{r, l} log(n))-approximation algorithm. Our algorithm is simple and combinatorial, in contrast with the previous approach that is based on randomized rounding applied to the solution of a linear program.
منابع مشابه
Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملMinimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کاملTraining Radial Basis Function Neural Network using Stochastic Fractal Search Algorithm to Classify Sonar Dataset
Radial Basis Function Neural Networks (RBF NNs) are one of the most applicable NNs in the classification of real targets. Despite the use of recursive methods and gradient descent for training RBF NNs, classification improper accuracy, failing to local minimum and low-convergence speed are defects of this type of network. In order to overcome these defects, heuristic and meta-heuristic algorith...
متن کاملEstimation of LOS Rates for Target Tracking Problems using EKF and UKF Algorithms- a Comparative Study
One of the most important problem in target tracking is Line Of Sight (LOS) rate estimation for using from PN (proportional navigation) guidance law. This paper deals on estimation of position and LOS rates of target with respect to the pursuer from available noisy RF seeker and tracker measurements. Due to many important for exact estimation on tracking problems must target position and Line O...
متن کامل